Termination w.r.t. Q proof of TRS/TRCSREx6_Luc98

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__from₁(X)) -> FROM₁(activate₁(X))
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__s₁(X)) -> S₁(activate₁(X))
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__from₁(X)) -> FROM₁(activate₁(X))
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__s₁(X)) -> S₁(activate₁(X))
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(ACTIVATE₁(x₁)) = 2·x₁
POL(FIRST₂(x₁, x₂)) = 2·x₂
POL(activate₁(x₁)) = x₁
POL(cons₂(x₁, x₂)) = x₂
POL(first₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(from₁(x₁)) = 2 + 2·x₁
POL(n__first₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__from₁(x₁)) = 2 + 2·x₁
POL(n__s₁(x₁)) = x₁
POL(nil) = 0
POL(s₁(x₁)) = x₁

The following usable rules [14] were oriented:

first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__s₁(X)) -> s₁(activate₁(X))
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
first₂(0, X) -> nil
activate₁(X) -> X
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(ACTIVATE₁(x₁)) = 2·x₁
POL(FIRST₂(x₁, x₂)) = 2·x₂
POL(activate₁(x₁)) = x₁
POL(cons₂(x₁, x₂)) = 2·x₂
POL(first₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(from₁(x₁)) = 0
POL(n__first₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__from₁(x₁)) = 0
POL(n__s₁(x₁)) = 2 + 2·x₁
POL(nil) = 0
POL(s₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented:

first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__s₁(X)) -> s₁(activate₁(X))
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
first₂(0, X) -> nil
activate₁(X) -> X
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__first₂(X1, X2)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(activate₁(X1), activate₁(X2))

The remaining pairs can at least be oriented weakly.

FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(ACTIVATE₁(x₁)) = x₁
POL(FIRST₂(x₁, x₂)) = 2·x₂
POL(activate₁(x₁)) = x₁
POL(cons₂(x₁, x₂)) = 2·x₂
POL(first₂(x₁, x₂)) = 2 + x₁ + 2·x₂
POL(from₁(x₁)) = 0
POL(n__first₂(x₁, x₂)) = 2 + x₁ + 2·x₂
POL(n__from₁(x₁)) = 0
POL(n__s₁(x₁)) = 2 + 2·x₁
POL(nil) = 0
POL(s₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented:

first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__s₁(X)) -> s₁(activate₁(X))
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
first₂(0, X) -> nil
activate₁(X) -> X
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ QDPOrderProof

                    ↳ QDP

                      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

The TRS R consists of the following rules:

first₂(0, X) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
first₂(X1, X2) -> n__first₂(X1, X2)
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(activate₁(X1), activate₁(X2))
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.